翻訳と辞書 Words near each other ・ Boole's inequality ・ Boole's rule ・ Boole's syllogistic ・ Boolean ・ Boolean algebra ・ Boolean algebra (structure) ・ Boolean algebras canonically defined ・ Boolean analysis ・ Boolean circuit ・ Boolean conjunctive query ・ Boolean data type ・ Boolean delay equation ・ Boolean domain ・ Boolean expression ・ Boolean function ・ Boolean grammar ・ Boolean hierarchy ・ Boolean model (probability theory) ・ Boolean network ・ Boolean operation ・ Boolean operations on polygons ・ Boolean prime ideal theorem ・ Boolean ring ・ Boolean satisfiability problem ・ Boolean-valued ・ Boolean-valued function ・ Boolean-valued model ・ Booleo ・ Booleroo Centre ・ Booley Bay Formation Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Boolean grammar ： ウィキペディア英語版 Boolean grammar Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars allow implicit disjunction represented by multiple rules for a single nonterminal symbol, which is the only logical connective expressible in context-free grammars. Conjunction and negation can be used, in particular, to specify intersection and complement of languages. An intermediate class of grammars known as conjunctive grammars allows conjunction and disjunction, but not negation. The rules of a Boolean grammar are of the form $A\; \backslash to\; \backslash alpha\_1\; \backslash And\; \backslash ldots\; \backslash And\; \backslash alpha\_m\; \backslash And$ \lnot\beta_1 \And \ldots \And \lnot\beta_n where $A$ is a nonterminal, $m+n\; \backslash ge\; 1$ and $\backslash alpha\_1$, ..., $\backslash alpha\_m$, $\backslash beta\_1$, ..., $\backslash beta\_n$ are strings formed of symbols in $\backslash Sigma$ and $N$. Informally, such a rule asserts that every string $w$ over $\backslash Sigma$ that satisfies each of the syntactical conditions represented by $\backslash alpha\_1$, ..., $\backslash alpha\_m$ and none of the syntactical conditions represented by $\backslash beta\_1$, ..., $\backslash beta\_n$ therefore satisfies the condition defined by $A$. There exist several formal definitions of the language generated by a Boolean grammar. They have one thing in common: if the grammar is represented as a system of language equations with union, intersection, complementation and concatenation, the languages generated by the grammar must be the solution of this system. The semantics differ in details, some define the languages using language equations, some draw upon ideas from the field of logic programming. However, these nontrivial issues of formal definition are mostly irrelevant for practical considerations, and one can construct grammars according to the given informal semantics. The practical properties of the model are similar to those of conjunctive grammars, while the descriptional capabilities are further improved. In particular, some practically useful properties inherited from context-free grammars, such as efficient parsing algorithms, are retained, see . ==References== * * * * Okhotin, Alexander (2010). "Fast parsing for Boolean grammars: a generalization of Valiant's algorithm", International Conference on Developments in Language Theory (DLT 2010), Lecture Notes in Computer Science 6224, pp. 340-351. (Preprint ) available online. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Boolean grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.